Stateless RD Network Services
نویسندگان
چکیده
Rate-Delay (RD) Network Services constitute a promising differentiated-services architecture for multi-provider networks, by offering users a choice between high throughput or low queuing delay at bottleneck links. An RD router provides service differentiation via transmission scheduling and by managing two FIFO queues. To ensure strict delay bounds, an RD router tracks arrival times of packets in the D service queue, and discards late packets at the queue head. However, maintaining the per-packet state is undesirable for complexity and cost reasons. In this paper, we present a Stateless RD (S-RD) router design that provides low queuing delay to the D service exclusively via buffer dimensioning, without requiring any per-packet state. After proving analytically that the S-RD design meets the delay guarantees, we use simulation to evaluate the performance of the stateless design, confirming that S-RD routers preserve the delay bounds of RD network services. As case studies, we consider Voice-over-IP (VoIP) and Web browsing as particular examples of Internet applications. The extensive simulation results demonstrate that S-RD Network Services significantly improve VoIP quality and increase the goodput of short-lived Web flows, without degrading the throughput of long-lived flows.
منابع مشابه
A Stateless Network Architecture for Inter-Enterprise Authentication, Authorization and Accounting
Providing network infrastructure for authenti-cation, authorization and accounting (AAA) functionalities required by inter-enterprise business applications operating over the global Internet is a challenging problem. The infrastructure needs to support large numbers of clients and services, and also to provide secure resources sharing between applications and across organizations. This paper de...
متن کاملAssuring Fair Allocation of Excess Bandwidth in Reservation Based Core-Stateless Networks
Assuring guaranteed services and providing fair bandwidth sharing are much sought characteristics in the current network architecture research. The IntServ approaches achieve those characteristics but only at the expense of using per-flow states and signaling, which are not scalable and difficult to implement. Alternatively, the stateless approaches proposed up to now are focused either on prov...
متن کاملDistributed Admission Control to Support Guaranteed Services in Core-Stateless Networks
The core-stateless service architecture alleviates the scalability problems of the integrated service framework while maintaining its guaranteed service semantics. The admission control methods proposed to support core-stateless guaranteed services have significant drawbacks. We propose a scalable and robust distributed admission control architecture to support corestateless guaranteed services...
متن کاملA new traffic model for core-stateless scheduling
similar level of guaranteed services as the stateful approach, while they do not need per-flow management. They hence possess both the properties of Quality-of-Service (QoS) provisioning and high scalability. In this paper, by showing the current existing traffic models are not applicable to core-stateless networks, a new and efficient traffic model for characterizing traffic in a core-stateles...
متن کاملStateful vs. stateless admission control: which can be the gap in utilization efficiency?
IETF developed two main approaches to provide QoS aware services in the Internet: Integrated Services (IntServ) and Differentiated Services (DiffServ). Both have well known pros and cons (e.g., [1][2]). The stateful IntServ has a greater level of accuracy and a finer level of granularity. The stateless DiffServ possesses excellent scaling properties, but lacks a standardized admission control s...
متن کامل